On Belief Propagation Decoding of LDPC Codes over Groups
نویسندگان
چکیده
We introduce a wide class of LDPC codes, large enough to include LDPC codes over finite fields, rings or groups as well as some non-linear codes. This class is defined by an extension of the parity-check equations involved in the code’s definition. A belief propagation decoding procedure with the same complexity as for the decoding of LDPC codes over finite fields is presented for theses new parities. Examples are given that illustrate the interest of this new code family.
منابع مشابه
Analysis of Error Floors for Non-binary LDPC Codes over General Linear Group through q-Ary Memoryless Symmetric Channels
In this paper, we compare the decoding error rates in the error floors for non-binary low-density parity-check (LDPC) codes over general linear groups with those for non-binary LDPC codes over finite fields transmitted through the q-ary memoryless symmetric channels under belief propagation decoding. To analyze non-binary LDPC codes defined over both the general linear group GL(m, F2) and the f...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملHard Decision and Soft Decision Decoding Algorithms for Ldpc and Qc-ldpc Codes
In this paper Hard Decision and Soft Decision decoding techniques for Quasi-Cyclic-Low Density Parity Check (QC-LDPC) code and Low Density Parity Check (LDPC) code is introduced. QC-LDPC code is proposed to reduce the complexity of the Low Density Parity Check code while obtaining the similar performance. The decoding processes of these codes are easy to simplify and implement. The algorithms u...
متن کاملPerformance of Spatially-Coupled LDPC Codes and Threshold Saturation over BICM Channels
We study the performance of binary spatiallycoupled low-density parity-check codes (SC-LDPC) when used with bit-interleaved coded-modulation (BICM) schemes. This paper considers the cases when transmission takes place over additive white Gaussian noise (AWGN) channels and Rayleigh fast-fading channels. The technique of upper bounding the maximum-a-posteriori (MAP) decoding performance of LDPC c...
متن کامل